package com.zhanghp.class07;

/**
 * <h1>左神code</h1>
 *
 * @author zhanghp
 * @since 2024/2/2 9:59
 */
public class Code02_MergeSort_Recursion_Zuo {

    public int[] mergeSort(int[] arr) {
        return null;
    }

    public void process(int[] arr, int L, int R) {
        if (L == R) {
            return;
        }
        int mid = L + ((R - L) >> 1);
        process(arr, L, mid);
        process(arr, mid + 1, R);
        merge(arr, L, mid, R);
    }

    public void merge(int[] arr, int L, int mid, int R){

        int[] tmp = new int[R -L +1];
        int lIndex = L;
        int rIndex = mid + 1;
        int tmpIndex = 0;


    }


}
